A note on "Reducing the number of binary variables in cutting stock problems"

This study proposes a deterministic model to solve the two-dimensional cutting stock problem (2DCSP) using a much smaller number of binary variables and thereby reducing the complexity of 2DCSP. Expressing a 2DCSP with m stocks and n cutting rectangles requires 2n2 + n(m + 1) binary variables in the traditional model. In contrast, the proposed model uses n2 + n log2 m binary variables to express the 2DCSP. Experimental results showed that the proposed model is more efficient than the existing model.